on the numerical solution of generalized sylvester matrix equations
Authors
abstract
the global fom and gmres algorithms are among the effective methods to solve sylvester matrix equations. in this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two cg-type algorithms for solving generalized sylvester matrix equations. the proposed methods are iterative projection methods onto matrix krylov subspaces. numerical examples are presented.
similar resources
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
full textOn the Numerical Solution of Generalized Sylvester Matrix Equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Kr...
full textOn the Numerical Solution of Large Scale Sylvester Matrix Equations
This paper presents equivalent forms of the Sylvester matrix equations. These equivalent forms allow us to use block linear methods for solving large Sylvester matrix equations. In each step of theses iterative methods we use global FOM or global GMRES algorithm for solving an auxiliary block matrix equations. Also, some numerical experiments for obtaining the numerical approximated solution of...
full textThe Projected Generalized Sylvester Equations: Numerical Solution and Applications
In this paper we consider the numerical solution of large-scale projected generalized continuous-time and discrete-time Sylvester equations with low-rank right-hand sides. First, we present the results on the sufficient conditions for the existence, uniqueness, and analytic formula of the solutions of these equations. Second, we review the low-rank alternating direction implicit method and the ...
full textOn the generalized Sylvester mapping and matrix equations
General parametric solution to a family of generalized Sylvester matrix equations arising in linear system theory is presented by using the socalled generalized Sylvester mapping which has some elegant properties. The solution consists of some polynomial matrices satisfying certain conditions and a parametric matrix representing the degree of freedom in the solution. The results provide great c...
full textUsing operational matrix for numerical solution of fractional differential equations
In this article, we have discussed a new application of modification of hat functions on nonlinear multi-order fractional differential equations. The operational matrix of fractional integration is derived and used to transform the main equation to a system of algebraic equations. The method provides the solution in the form of a rapidly convergent series. Furthermore, error analysis of the pro...
full textMy Resources
Save resource for easier access later
Journal title:
bulletin of the iranian mathematical societyPublisher: iranian mathematical society (ims)
ISSN 1017-060X
volume 40
issue 1 2014
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023